|
In the mathematical field of graph theory, a core is a notion that describes behavior of a graph with respect to graph homomorphisms. == Definition == Graph is a core if every homomorphism is an isomorphism, that is it is a bijection of vertices of . A core of a graph is a graph such that # There exists a homomorphism from to , # there exists a homomorphism from to , and # is minimal with this property. Two graphs are said to be homomorphism equivalent or hom-equivalent if they have isomorphic cores. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Core (graph theory)」の詳細全文を読む スポンサード リンク
|